Towards Syntactic Epistemic Logic
نویسندگان
چکیده
Traditionally, Epistemic Logic represents epistemic scenarios using a single model. This, however, covers only complete descriptions that specify truth values of all assertions. Indeed, many—and perhaps most—epistemic are not complete. Syntactic Logic, SEL, suggests viewing an situation as set syntactic conditions rather than This allows us to naturally capture incomplete descriptions; we discuss case study in which our proposal is successful. In Game Theory, this closes the conceptual and technical gap, identified by R. Aumann, between character game-descriptions semantic representations games.
منابع مشابه
A Logic of Finite Syntactic Epistemic States
The thesis presents a logic of the explicit knowledge of deliberative agents who represent their knowledge symbolically as sets of formulae – agents with finite syntactic epistemic states. It is well known that modal epistemic logic either describes implicit knowledge, including all logical consequences of the explicit knowledge, or describes the explicit knowledge of unrealistically intelligen...
متن کاملTowards Abstract Interpretation of Epistemic Logic
The model-checking problem is to decide, given a formula φ and an interpretation M , whether M satisfies φ, written M |= φ. Model-checking algorithms for temporal logics were initially developed with finite models (such as models of hardware) in mind so that M |= φ is decidable. As interest grew in model-checking infinite systems, other approaches were developed based on approximating the model...
متن کاملTowards an Epistemic Logic of Concepts
What does it take to possess a concept? Behaviour of various degrees of complexity is based on different levels of cognitive abilities. Concept possession ranges between mere stimulus-response schemes and fully developed propositional representations. Both biological and artifical systems can be described in terms of these levels of cognitive abilities, and thus we can meaningfully ask whether ...
متن کاملTowards Model Checking Cryptographic Protocols with Dynamic Epistemic Logic
We present a variant of Kripke models to model knowledge of large numbers, applicable to cryptographic protocols. Our Epistemic Crypto Logic is a variant of Dynamic Epistemic Logic to describe communication and computation in a multi-agent setting. It is interpreted on register models which efficiently encode larger Kripke models. As an example we formalize the well-known Diffie-Hellman key exc...
متن کاملTowards Partial Order Reduction for Model Checking Temporal Epistemic Logic
We introduce basic partial order reduction techniques in a temporal-epistemic setting. We analyse the semantics of interpreted systems with respect to the notions of trace-equivalence for the epistemic linear time logic LTLK −X .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Informaticae
سال: 2022
ISSN: ['1875-8681', '0169-2968']
DOI: https://doi.org/10.3233/fi-222118